Surface Structures of Depositions from Biased Random Walks to the Substrate

نویسنده

  • Yup Kim
چکیده

is the same as diffusion-limited deposition. We find that the dynamical surface width W of the depositions from moderately biased RWs (b ≥ 0.6) on a substrate of size L in the dimensionality d = 1 + 1 is well described by W 2 = W 2 i + L f(t/L), where W 2 i is the intrinsic surface width which was also found in Eden growth. It is also found that the Wi tends to increase as b decreases and the exponents α and z are nearly the same as those of the ballistic deposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

شبیه سازی رشد ساختارهای ستونی مس تحت رونشست زاویه مایل و گام‌های تصادفی مونت کارلو

In this simulation model, oblique angle deposition method and Monte Carlo random walks have been used. Growth model was ballistic deposition (BD). Incident particles flux comes to substrate at an angle with respect to normal. Two physical factors including self-shadowing and mobility limitation of incident particles make structures similar to independent columns with different shapes and separa...

متن کامل

Nanoparticle-containing structures as a substrate for surface-enhanced Raman scattering.

Metallic nanostructures were prepared through the alternate immersion of derivatized glass slides in solutions of gold nanoparticles (NPs) and a propanedithiol linker molecule. Nanostructures consisting of 1-17 depositions of gold NPs were synthesized, and these substrates were characterized using UV-vis spectroscopy and atomic force microscopy. Subsequently, the surface-enhanced Raman scatteri...

متن کامل

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

Non-Backtracking Centrality Based Random Walk on Networks

Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997